Arithmetical Knowledge and Arithmetical Definability: Four Studies
نویسندگان
چکیده
by Sean Walsh The subject of this dissertation is arithmetical knowledge and arithmetical definability. The first two chapters contain respectively a critique of a logicist account of a preferred means by which we may legitimately infer to arithmetical truths and a tentative defense of an empiricist account. According to the logicist account, one may infer from quasi-logical truths to patently arithmetical truths because the arithmetical truths are representable in the logical truths. It is argued in the first chapter that this account is subject to various problems: for instance, the most straightforward versions seem vulnerable to various counterexamples. The basic idea of the alternative empiricist account considered in chapter two is that complicated arithmetical truths like mathematical induction may be inferred by way of confirmation from less complicated quantifier-free arithmetical truths. The notion of confirmation here is understood probabilistically, and responses are given in this chapter to several seeming problems with this importation of probability into arithmetic. The final two chapters are concerned with arithmetical definability in two different settings. In the third chapter, the interpretability strength of the arithmetical and hyperarithmetical subsystems of second-order Peano arithmetic is
منابع مشابه
Arithmetical definability over finite structures
Arithmetical definability has been extensively studied over the natural numbers. In this paper, we take up the study of arithmetical definability over finite structures, motivated by the correspondence between uniform and . We prove finite analogs of three classic results in arithmetical definability, namely that and TIMES can first-order define PLUS, that and DIVIDES can first-order define TIM...
متن کاملDefinability and Decision Problems in Arithmetic
Introduction. In this paper, we are concerned with the arithmetical definability of certain notions of integers and rationals in terms of other notions. The results derived will be applied to obtain a negative solution of corresponding decision problems. In Section 1, we show that addition of positive integers can be defined arithmetically in terms of multiplication and the unary operation of s...
متن کاملKolmogorov complexity of initial segments of sequences and arithmetical definability
The structure of the K-degrees provides a way to classify sets of natural numbers or infinite binary sequences with respect to the level of randomness of their initial segments. In the K-degrees of infinite binary sequences, X is below Y if the prefix-free Kolmogorov complexity of the first n bits of X is less than the complexity of the first n bits of Y , for each n. Identifying infinite binar...
متن کاملEmpiricism, Probability, and Knowledge of Arithmetic
The thesis that I want to examine today is this: arithmetical knowledge may be legitimately extended by confirmation just as it may be by proof. This thesis is one component of a broader empirical account of arithmetical knowledge, according to which: subsequent to some appropriately empirical acquisition of knowledge of quantifier-free truths like 7 + 5 = 12, one may legitimately extend this k...
متن کامل2 4 M ar 2 00 7 On the hierarchies of universal predicates
We investigate a hierarchy of arithmetical structures obtained by transfinite addition of a canonic universal predicate, where the canonic universal predicate for M is defined as a minimum universal predicate for M in terms of definability. We determine the upper bound of the hierarchy and give a characterisation for the sets definable in the hierarchy.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010